An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space
نویسندگان
چکیده
منابع مشابه
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games
In a mean-payoff parity game, one of the two players aims both to achieve a qualitative parity objective and to minimize a quantitative long-term average of payoffs (aka. mean payoff). The game is zero-sum and hence the aim of the other player is to either foil the parity objective or to maximize the mean payoff. Our main technical result is a pseudo-quasi-polynomial algorithm for solving mean-...
متن کاملA short proof of correctness of the quasi-polynomial time algorithm for parity games
Recently Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li and Frank Stephan proposed a quasi-polynomial time algorithm for parity games [1]. This paper proposes a short proof of correctness of their algorithm.
متن کاملSolving the discrete logarithms in quasi-polynomial time
The discrete logarithm has similar algebraic properties as for logarithm in reals. Namely, logg(hh ′) = logg(h) + logg(h ′). The discrete logarithm problem is also randomly self-reducible. This means that there are no “difficult” problems. If there would be an element h in the group for which the logarithm is hard to solve, then it is possible to take 1 ≤ x ≤ q, where q is the order of the grou...
متن کاملFrom Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets
We consider conditions which force a well-quasi-ordered poset (wqo) to be betterquasi-ordered (bqo). In particular we obtain that if a poset P is wqo and the set Sω(P ) of strictly increasing sequences of elements of P is bqo under domination, then P is bqo. As a consequence, we get the same conclusion if Sω(P ) is replaced by J (P ), the collection of non-principal ideals of P , or by AM(P ), ...
متن کاملA Quasi-Random Approach to Space-Time Codes
This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission rate and antenna numbers. We outline a turbo-type iterative decoding algorithm with complexity growing linearly with the transmit antenna number, and independently of the layer number. We develop simple techniques for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2019
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-019-00509-3